Cycles identifying vertices for fault isolation in locally twisted cubes.dvi
نویسندگان
چکیده
A set of subgraphs C1, C2, . . . , Ck in a graph G is said to identify the vertices if the sets {j | v ∈ Cj} are nonempty for all the vertices v and no two are the same set. We consider the problem of minimizing k when the subgraphs Ci are required to be cycles. The motivation comes from fault diagnosis of multiprocessor systems. We study the cases when G is the locally twisted cube.
منابع مشابه
Conditional Diagnosability of the Locally Twisted Cubes under the PMC Model
In a multiprocessor systems, it is important to local and to replace the faulty processors to maintain systempsilas high reliability. The fault diagnosis, which is the process of identifying fault processors in a multiprocessor system through testing. The conditional diagnosis requires that for each processor u in a system, all the processors that are directly connected to u do not fail at the ...
متن کاملLocating sensors in paths and cycles: The case of 2-identifying codes
For a graph G and a set D ⊆ V (G), define Nr[x] = {xi ∈ V (G) : d(x, xi) ≤ r} (where d(x, y) is graph theoretic distance) and Dr(x) = Nr[x] ∩ D. D is known as an r-identifying code if for every vertex x, Dr(x) 6= ∅, and for every pair of vertices x and y, x 6= y ⇒ Dr(x) 6= Dr(y). The various applications of these codes include attack sensor placement in networks and fault detection/localization...
متن کاملEdge-fault-tolerant hamiltonicity of locally twisted cubes under conditional edge faults
The locally twisted cube is a variation of hypercube, which possesses some properties superior to the hypercube. In this paper, we investigate the edge-faulttolerant hamiltonicity of an n-dimensional locally twisted cube, denoted by LTQn. We show that for any LTQn (n ≥ 3) with at most 2n− 5 faulty edges in which each node is incident to at least two fault-free edges, there exists a fault-free H...
متن کاملWirelength of 1-fault hamiltonian graphs into wheels and fans
In this paper we obtain a fundamental result to find the exact wirelength of 1-fault hamiltonian graphs into wheels and fans. Using this result we compute the exact wirelength of circulant graphs, generalized petersen graphs, augmented cubes, crossed cubes, mőbius cubes, locally twisted cubes, twisted cubes, twisted n-cubes, generalized twisted cubes, hierarchical cubic networks, alternating gr...
متن کاملThe Paradoxical Nature of Locating Sensors in Paths and Cycles: The Case of 2-Identifying Codes
For a graph G and a set D ⊆ V (G), define Nr[x] = {xi ∈ V (G) : d(x, xi) ≤ r} (where d(x, y) is graph theoretic distance) and Dr(x) = Nr[x] ∩D. D is known as an r-identifyingcode if for every vertex x, Dr(x) 6= ∅, and for every pair of vertices x and y, x 6= y ⇒ Dr(x) 6= Dr(y). The various applications of these codes include attack sensor placement in networks and fault detection/localization i...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2014